Balanced Partition of Minimum Spanning Trees
نویسندگان
چکیده
To better handle situations where additional resources are available to carry out a task, many problems from the manufacturing industry involve “optimally” dividing a task into k smaller tasks. We consider the problem of partitioning a given set S of n points (in the plane) into k subsets, S1, . . . ,Sk, such that max16i6k |MST (Si)| is minimized. A variant of this problem arises in the shipbuilding industry [2].
منابع مشابه
Proximity Drawings of High-Degree Trees
A drawing of a given (abstract) tree that is a minimum spanning tree of the vertex set is considered aesthetically pleasing. However, such a drawing can only exist if the tree has maximum degree at most 6. What can be said for trees of higher degree? We approach this question by supposing that a partition or covering of the tree by subtrees of bounded degree is given. Then we show that if the p...
متن کاملOptimal random matchings, tours, and spanning trees in hierarchically separated trees
We derive tight bounds on the expected weights of several combinatorial optimization problems for random point sets of size n distributed among the leaves of a balanced hierarchically separated tree. We consider monochromatic and bichromatic versions of the minimum matching, minimum spanning tree, and traveling salesman problems. We also present tight concentration results for the monochromatic...
متن کاملPartition functions of discrete coalescents: from Cayley’s formula to Frieze’s ζ(3) limit theorem
In these expository notes, we describe some features of the multiplicative coalescent and its connection with random graphs and minimum spanning trees. We use Pitman’s proof [13] of Cayley’s formula, which proceeds via a calculation of the partition function of the additive coalescent, as motivation and as a launchpad. We define a random variable which may reasonably be called the empirical par...
متن کاملMinmax Tree Cover in the Euclidean Space
Let G = (V,E) be an edge-weighted graph, and let w(H) denote the sum of the weights of the edges in a subgraph H of G. Given a positive integer k, the balanced tree partitioning problem requires to cover all vertices in V by a set T of k trees of the graph so that the ratio α of maxT∈T w(T ) to w(T ∗)/k is minimized, where T ∗ denotes a minimum spanning tree of G. The problem has been used as a...
متن کاملA Generalized Distance in Graphs and Centered Partitions
This paper is concerned with a new distance in undirected graphs with weighted edges, which gives new insights into the structure of all minimum spanning trees of a graph. This distance is a generalized one, in the sense that it takes values in a certain Heyting semigroup. More precisely, it associates with each pair of distinct vertices in a connected component of a graph the set of all paths ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2002